Left Termination of the query pattern select_in_3(a, a, g) w.r.t. the given Prolog program could successfully be proven:



↳ Prolog
  ↳ PrologToPiTRSProof

Clauses:

select(X, .(X, Xs), Xs).
select(X, .(Y, Xs), .(Y, Zs)) :- select(X, Xs, Zs).

Queries:

select(a,a,g).

We use the technique of [30].Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

select_in(X, .(Y, Xs), .(Y, Zs)) → U1(X, Y, Xs, Zs, select_in(X, Xs, Zs))
select_in(X, .(X, Xs), Xs) → select_out(X, .(X, Xs), Xs)
U1(X, Y, Xs, Zs, select_out(X, Xs, Zs)) → select_out(X, .(Y, Xs), .(Y, Zs))

The argument filtering Pi contains the following mapping:
select_in(x1, x2, x3)  =  select_in(x3)
.(x1, x2)  =  .(x2)
U1(x1, x2, x3, x4, x5)  =  U1(x5)
select_out(x1, x2, x3)  =  select_out(x2)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog



↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

select_in(X, .(Y, Xs), .(Y, Zs)) → U1(X, Y, Xs, Zs, select_in(X, Xs, Zs))
select_in(X, .(X, Xs), Xs) → select_out(X, .(X, Xs), Xs)
U1(X, Y, Xs, Zs, select_out(X, Xs, Zs)) → select_out(X, .(Y, Xs), .(Y, Zs))

The argument filtering Pi contains the following mapping:
select_in(x1, x2, x3)  =  select_in(x3)
.(x1, x2)  =  .(x2)
U1(x1, x2, x3, x4, x5)  =  U1(x5)
select_out(x1, x2, x3)  =  select_out(x2)


Using Dependency Pairs [1,30] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → U11(X, Y, Xs, Zs, select_in(X, Xs, Zs))
SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → SELECT_IN(X, Xs, Zs)

The TRS R consists of the following rules:

select_in(X, .(Y, Xs), .(Y, Zs)) → U1(X, Y, Xs, Zs, select_in(X, Xs, Zs))
select_in(X, .(X, Xs), Xs) → select_out(X, .(X, Xs), Xs)
U1(X, Y, Xs, Zs, select_out(X, Xs, Zs)) → select_out(X, .(Y, Xs), .(Y, Zs))

The argument filtering Pi contains the following mapping:
select_in(x1, x2, x3)  =  select_in(x3)
.(x1, x2)  =  .(x2)
U1(x1, x2, x3, x4, x5)  =  U1(x5)
select_out(x1, x2, x3)  =  select_out(x2)
SELECT_IN(x1, x2, x3)  =  SELECT_IN(x3)
U11(x1, x2, x3, x4, x5)  =  U11(x5)

We have to consider all (P,R,Pi)-chains

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → U11(X, Y, Xs, Zs, select_in(X, Xs, Zs))
SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → SELECT_IN(X, Xs, Zs)

The TRS R consists of the following rules:

select_in(X, .(Y, Xs), .(Y, Zs)) → U1(X, Y, Xs, Zs, select_in(X, Xs, Zs))
select_in(X, .(X, Xs), Xs) → select_out(X, .(X, Xs), Xs)
U1(X, Y, Xs, Zs, select_out(X, Xs, Zs)) → select_out(X, .(Y, Xs), .(Y, Zs))

The argument filtering Pi contains the following mapping:
select_in(x1, x2, x3)  =  select_in(x3)
.(x1, x2)  =  .(x2)
U1(x1, x2, x3, x4, x5)  =  U1(x5)
select_out(x1, x2, x3)  =  select_out(x2)
SELECT_IN(x1, x2, x3)  =  SELECT_IN(x3)
U11(x1, x2, x3, x4, x5)  =  U11(x5)

We have to consider all (P,R,Pi)-chains
The approximation of the Dependency Graph [30] contains 1 SCC with 1 less node.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → SELECT_IN(X, Xs, Zs)

The TRS R consists of the following rules:

select_in(X, .(Y, Xs), .(Y, Zs)) → U1(X, Y, Xs, Zs, select_in(X, Xs, Zs))
select_in(X, .(X, Xs), Xs) → select_out(X, .(X, Xs), Xs)
U1(X, Y, Xs, Zs, select_out(X, Xs, Zs)) → select_out(X, .(Y, Xs), .(Y, Zs))

The argument filtering Pi contains the following mapping:
select_in(x1, x2, x3)  =  select_in(x3)
.(x1, x2)  =  .(x2)
U1(x1, x2, x3, x4, x5)  =  U1(x5)
select_out(x1, x2, x3)  =  select_out(x2)
SELECT_IN(x1, x2, x3)  =  SELECT_IN(x3)

We have to consider all (P,R,Pi)-chains
For (infinitary) constructor rewriting [30] we can delete all non-usable rules from R.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof
                ↳ PiDP
                  ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

SELECT_IN(X, .(Y, Xs), .(Y, Zs)) → SELECT_IN(X, Xs, Zs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x2)
SELECT_IN(x1, x2, x3)  =  SELECT_IN(x3)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog
  ↳ PrologToPiTRSProof
    ↳ PiTRS
      ↳ DependencyPairsProof
        ↳ PiDP
          ↳ DependencyGraphProof
            ↳ PiDP
              ↳ UsableRulesProof
                ↳ PiDP
                  ↳ PiDPToQDPProof
                    ↳ QDP
                      ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

SELECT_IN(.(Zs)) → SELECT_IN(Zs)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: